Adaptive constructive interval disjunction: algorithms and experiments
نویسندگان
چکیده
منابع مشابه
Constructive Interval Disjunction
This paper presents two new filtering operators for numerical CSPs (systems with constraints over the reals) based on constructive disjunction, as well as a new splitting heuristic. The fist operator (CID) is a generic algorithm enforcing constructive disjunction with intervals. The second one (3BCID) is a hybrid algorithm mixing constructive disjunction and shaving, another technique already u...
متن کاملConstructive Disjunction in Oz
Constraint programming has been proved as an excellent tool to solve combinatori-al problems in many application areas. Through constraint propagation large parts of the search space can be pruned away. Hard problems are those which involve disjunc-tive constraints introducing non-determinism. While the introduction of choice-points for disjunctive constraints may lead to combinatorial explosio...
متن کاملConstructive Disjunction Revisited
Finite Domain Programming is a technique for solving com-binatorial problems like planning, scheduling, connguration or timetabling. Inevitably, these problems employ disjunctive constraints. A rather new approach to model those constraints is constructive disjunction, whereby common information is lifted from the alternatives, aiming for stronger pruning of the search space. We show where cons...
متن کاملParallel computation on interval graphs: algorithms and experiments
This paper describes efficient coarse-grained parallel algorithms and implementations for a suite of interval graph problems. Included are algorithms requiring only a constant number of communication rounds for connected components, maximum weighted clique, and breadth-first-search and depth-first-search trees, as well as O(log p) communication rounds algorithms for optimization problems such a...
متن کاملEfficient and Constructive Algorithms
In this paper we give, for all constants k, l, explicit algorithms, that given a graph G = (V, E) with a tree-decomposition of G with treewidth at most l, decide whether the treewidth (or pathwidth) of G is at most k, and if so, find a tree-decomposition or (path-decomposition) of G of width at most k, and that use O(IVD time. In contrast with previous solutions, our algorithms do not rely on n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Constraints
سال: 2015
ISSN: 1383-7133,1572-9354
DOI: 10.1007/s10601-015-9180-3